Coalition Formability Semantics with Conflict-Eliminable Sets of Arguments
نویسندگان
چکیده
We consider abstract-argumentation-theoretic coalition formability in this work. Taking a model in political alliance among political parties, we will contemplate profitability, and then formability, of a coalition. As is commonly understood, a group forms a coalition with another group for a greater good, the goodness measured against some criteria. As is also commonly understood, however, a coalition may deliver benefits to a group X at the sacrifice of something that X was able to do before coalition formation, which X may be no longer able to do under the coalition. Use of the typical conflict-free sets of arguments is not very fitting for this aspect of coalition, which prompts us to turn to a weaker notion, conflicteliminability, as a property that a set of arguments should primarily satisfy. We require numerical quantification of attack strengths as well as of argument strengths for its characterisation. We will first analyse semantics of profitability of a given conflict-eliminable set forming a coalition with another conflict-eliminable set, and will then provide four coalition formability semantics, each of which formalises certain utility postulate(s) taking the coalition profitability into account.
منابع مشابه
Conflicts in Abstract Argumentation
In abstract argumentation traditionally directed attacks might also be called conflicts if the direction of the attack is not of importance. Recent publications emphasize that argumentation graphs when combined with some semantics feature semantic conflicts that might not coincide with syntactic conflicts defined by attacks. We elaborate on characteristics of various semantics and investigate p...
متن کاملCoalitions of arguments in bipolar argumentation frameworks
Bipolar argumentation frameworks enable to represent two kinds of interaction between arguments: support and conflict. In this paper, we turn a bipolar argumentation framework into a “meta-argumentation” framework where conflicts occur between sets of arguments, characterized as coalitions of supporting arguments. So, Dung’s well-known semantics can be used on this metaargumentation framework i...
متن کاملOn Looking for Local Expansion Invariants in Argumentation Semantics
We study invariant local expansion operators for conflict-free and admissible sets in Abstract Argumentation Frameworks (AFs). Such operators are directly applied on AFs, and are invariant with respect to a chosen “semantics” (that is w.r.t. each of the conflict free/admissible set of arguments). Accordingly, we derive a definition of robustness for AFs in terms of the number of times such oper...
متن کاملAn argumentation system for reasoning with LPm
Inconsistent knowledge-bases can entail useful conclusions when using the three-valued semantics of the paraconsistent logic LP. However, the set of conclusions entailed by a consistent knowledge-base under the three-valued semantics is smaller than set of conclusions entailed by the knowledge-base under a two-valued semantics. Preferring conflict-minimal interpretations of the logic LP; i.e., ...
متن کاملCharacterization of Semantics for Argument Systems
We consider Dung’s argumentation framework, in which an argument system consists of a set of arguments and a binary relation between arguments representing the notion of a conflict. The semantics given by Dung define (with respect to each argument system) acceptable sets of arguments called extensions. For his so-called stable semantics, Dung also gives an alternative definition in terms of an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017